Efficient k-nearest neighbor searching in nonordered discrete data spaces
نویسندگان
چکیده
منابع مشابه
Techniques for Efficient K-nearest Neighbor Searching in Non-ordered Discrete and Hybrid Data Spaces
TECHNIQUES FOR EFFICIENT K-NEAREST NEIGHBOR SEARCHING IN NON-ORDERED DISCRETE AND HYBRID DATA SPACES
متن کاملk-Nearest neighbor searching in hybrid spaces
Little work has been reported in the literature to support k-nearest neighbor (k-NN) searches/ queries in hybrid data spaces (HDS). An HDS is composed of a combination of continuous and non-ordered discrete dimensions. This combination presents new challenges in data organization and search ordering. In this paper, we present an algorithm for k-NN searches using a stages and use the properties ...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملNear neighbor searching with K nearest references
Proximity searching is the problem of retrieving, from a given database, those objects closest to a query. To avoid exhaustive searching, data structures called indexes are built on the database prior to serving queries. The curse of dimensionality is a well-known problem for indexes: in spaces with sufficiently concentrated distance histograms, no index outperforms an exhaustive scan of the da...
متن کاملEfficient K-nearest-neighbor for discrete feature spaces with separable distance function
Suppose we have a discrete features space F = F1 × · · · × FM , where the Fm are discrete sets. Suppose our training examples are nonredundant (a given point in feature space only appears at most once in the training set). Then the set of training examples is S ⊆ F . Suppose S is generated randomly by choosing each element of the whole feature space F to be included in our training set S with p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Information Systems
سال: 2010
ISSN: 1046-8188,1558-2868
DOI: 10.1145/1740592.1740595